منابع مشابه
Random Walks That Avoid Their past Convex Hull
We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction are on the order of n. This behavior is also observed for the extremal investor, a natural financial model related to the planar walk. Figure 1: 300 steps of the rancher
متن کاملNetGAN: Generating Graphs via Random Walks
We propose NetGAN – the first implicit generative model for graphs able to mimic real-world networks. We pose the problem of graph generation as learning the distribution of biased random walks over the input graph. The proposed model is based on a stochastic neural network that generates discrete output samples and is trained using the Wasserstein GAN objective. NetGAN is able to produce graph...
متن کاملGenerating Functions of Random Walks on Graphs
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
متن کاملRandom walks on generating sets for
We analyze a certain random walk on the cartesian product G n of a nite group G which is often used for generating random elements from G. In particular, we show that the mixing time of the walk is at most c r n 2 logn where the constant c r depends only on the order r of G.
متن کاملRandom walks on generating sets for nite groupsF
We analyze a certain random walk on the cartesian product G n of a nite group G which is often used for generating random elements from G. In particular, we show that the mixing time of the walk is at most c r n 2 logn where the constant c r depends only on the order r of G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 1989
ISSN: 0167-2789
DOI: 10.1016/0167-2789(89)90222-4